skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 3

Search for: All records

Creators/Authors contains: "Tkocz, Tomasz"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Duke Mathematical Journal)
    Free, publicly-accessible full text available November 15, 2025
  2. ; ; (, Mathematische Annalen)
    Abstract We prove an extension of Szarek’s optimal Khinchin inequality (1976) for distributions close to the Rademacher one, when all the weights are uniformly bounded by a$$1/\sqrt{2}$$ 1 / 2 fraction of their total$$\ell _2$$ ℓ 2 -mass. We also show a similar extension of the probabilistic formulation of Ball’s cube slicing inequality (1986). These results establish the distributional stability of these optimal Khinchin-type inequalities. The underpinning to such estimates is the Fourier-analytic approach going back to Haagerup (1981). 
    more » « less
    Full Text Available 
  3. ; ; (, Journal d'Analyse Mathématique)
    Full Text Available 
  4. ; ; ; (, The Electronic Journal of Combinatorics)
    Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common optimisation problems, we establish asymptotically tight bounds when the weights are independent copies of a symmetric random variable (satisfying a mild condition on tail probabilities), in particular when the weights are Gaussian. 
    more » « less
    Full Text Available 
  5. ; ; (, The Annals of Probability)
    Full Text Available 
  6. ; ; (, SIAM Journal on Discrete Mathematics)
    Full Text Available 
  7. ; (, Mathematics of Operations Research)
    We study the minimum spanning arborescence problem on the complete digraph [Formula: see text], where an edge e has a weight W e and a cost C e , each of which is an independent uniform random variable U s , where [Formula: see text] and U is uniform [Formula: see text]. There is also a constraint that the spanning arborescence T must satisfy [Formula: see text]. We establish, for a range of values for [Formula: see text], the asymptotic value of the optimum weight via the consideration of a dual problem. 
    more » « less
    Full Text Available 
  8. ; ; (, Mathematika)
    Abstract We prove a dimension‐free stability result for polydisc slicing due to Oleszkiewicz and Pełczyński. Intriguingly, compared to the real case, there is an additional asymptotic maximizer. In addition to Fourier‐analytic bounds, we crucially rely on a self‐improving feature of polydisc slicing, established via probabilistic arguments. 
    more » « less
  9. ; ; (, Proceedings of the American Mathematical Society)
    Full Text Available 
  10. ; (, Israel Journal of Mathematics)
    Full Text Available